#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, k;
    cin >> n >> k;
    V<int> w(n + 1, 0);
    map<int, int> mp;
    FOR(i, 1, n) cin >> w[i], mp[w[i]]++;

    for (auto [x, y] : mp) {
        if (y >= k) {
            cout << 0 << endl;
            RE;
        }
    }

    ranges::sort(w);

    set<int> s;

    FOR(i, 1, n) {
        int t = w[i];
        while (t) {
            s.insert(t);
            t /= 2;
        }
        s.insert(0);
    }

    int ans = 1e18;

    for (auto x : s) {
        int cnt = 0;
        int c2 = 0;
        FOR(i, 1, n) {
            int t = w[i];
            int p = 0;
            while (t) {
                if (t == x) {
                    break;
                }
                t /= 2;
                p++;
            }
            if (t == x) {
                cnt += p;
                c2++;
            }
            if (c2 >= k) {
                ans = min(ans, cnt);
                break;
            }
        }
    }

    cout << ans;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}